- 整数分解难题
- integer factorization problem, ifp: 整数分解难题
- integer factorization: 整数分解; 质因数分解
- all integer problem: 全整数问题
- integer programming problem: 整数规划问题
- mixed-integer problem: 混合整数问题
下载手机词典可随时随地查词查翻译
integer factorization problem中文什么意思
- 整数分解难题
下载手机词典可随时随地查词查翻译
例句与用法
- using the idea of secret-sharing and signature-of-knowledge, a new perfect and strong key-insulated signature scheme based on the assumption of integer factorization problem is proposed . the scheme has a low computation in key updating and signing, thus fitting for the mobile devices
(6)对签名系统中的密钥泄露问题进行了研究，在分析相关技术的基础上，利用秘密分享和知识签名，给出了一个完善的强key-insulated签名方案。 - the elliptic curve digital signature algorithm ( ecdsa ) is the elliptic curve analogue of the digital signature algorithm ( dsa ) . it was accepted in 1999 as an ansi standard, and was accepted in 2000 as ieee and nist standards . unlike the ordinary discrete logarithm problem and the integer factorization problem, no subexponential-time is known for the elliptic curve discrete logarithm problem . for this reason, the strength-per-key-bit is substantially greater in an algorithm that uses elliptic curves
椭圆曲线数字签名算法（ecdsa）是数字签名算法（dsa）的椭圆曲线对等。它先后成为ansi，ieee，nist和iso的标准，而且其它的一些组织正在考虑成为其标准。不象普通的离散对数问题和因数分解问题，椭圆曲线离散对数问题没有已知的亚指数算法，所以使用椭圆曲线的算法在密钥的位强度是足够高的。